Concatenated codes with convolutional inner codes
نویسندگان
چکیده
We study the minimum distance of concatenated codes with Reed-Solomon outer codes and convolutional inner codes. For suitable combinations of parameters the minimum distance may be lower-bounded by the product of the minimum distances of the inner and outer codes. For a randomized ensemble of concatenated codes we prove a GilbertVarsharnov-type lower bound.
منابع مشابه
A convolutional single-parity-check concatenated coding scheme for high-data-rate applications
Absfmcf-The paper describes the possible implementation of concatenated coding scheme suitable particularly for high date rate applications. The proposed coding scheme uses a set of n convolutional codes multiplexed into an inner code and a (n, n 1) single-parity-check code serving as the outer code. Each of the inner convolutional codes is decoded independently with maximum-likelihood decoding...
متن کاملExponential Error Bounds for Block Concatenated Codes with Tail Biting Trellis Inner Codes
Tail biting trellis codes and block concatenated codes are discussed from random coding arguments. An error exponent and decoding complexity for tail biting random trellis codes are shown. Then we propose a block concatenated code constructed by a tail biting trellis inner code and derive an error exponent and decoding complexity for the proposed code. The results obtained by the proposed code ...
متن کاملInner Code Rate Selection for a Concatenated Coding
| Concatenated codes have long been used as a practical means of combating errors on very noisy channels. In this paper we investigate the performance of concatenated systems that employ inner convolutional codes with outer Reed-Solomon codes. We determine upper and lower bounds of the optimal inner code rate for a selected overall code rate on a binary symmetric channel .
متن کاملHybrid Concatenated Codes and Iterative Decoding
A hybrid concatenated code with two interleavers is the parallel concatenation of an encoder, which accepts the permuted version of the information sequence as its input, with a serially concatenated code, which accepts the unpermuted information sequence. The serially concatenated code consists of an outer encoder, an interleaver, and an inner encoder. An upper bound to the average maximum-lik...
متن کاملAnalysis, Design, and Iterative Decoding of Double Serially Concatenated Codes with Interleavers
A double serially concatenated code with two interleaves consists of the cascade of an outer encoder, an interleaver permuting the outer codeword bits, a middle encoder, another interleaver permuting the middle codeword bits and an inner encoder whose input words are the permuted middle codewords. The construction can be generalized to h cascaded encoders separated by h – 1 interleavers, where ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE Trans. Information Theory
دوره 34 شماره
صفحات -
تاریخ انتشار 1988